Distance spectral radius of trees with fixed number of pendent vertices

Distance spectral radius of trees with fixed number of pendent vertices

Article history: Received 16 October 2012 Accepted 25 June 2013 Available online 12 July 2013 Submitted by R. Brualdi

Distance spectral radius of trees with fixed maximum degree

Ela Distance Spectral Radius of Trees with Fixed Maximum Degree∗

Abstract. Distance energy is a newly introduced molecular graph-based analog of the total π-electron energy, and it is defined as the sum of the absolute eigenvalues of the molecular distance matrix. For trees and unicyclic graphs, distance energy is equal to the doubled value of the distance spectral radius. In this paper, we introduce a general transformation that increases the distance spect...

The spectral radius of tricyclic graphs with n vertices and k pendent vertices

In this paper, we determine graphs with the largest spectral radius among all the tricyclic graphs with n vertices and k pendent vertices. © 2008 Elsevier Inc. All rights reserved. AMS classification: 05C50; 05C35

The distance spectral radius of graphs with given number of odd vertices